Remark on Ozeki Inequality for Convex Polygons
نویسندگان
چکیده
This paper gives proof of a discrete inequality that represents Ozeki’s inequality for convex polygons and its converse. The proof is based on determining eigenvalues of one nearly tridiagonal symmetric matrix.
منابع مشابه
On generalized Hermite-Hadamard inequality for generalized convex function
In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.
متن کاملAffinely Regular Polygons as Extremals of Area Functionals
For any convex n-gon P we consider the polygons obtained dropping a vertex or an edge of P . The area distance of P to such (n − 1)-gons, divided by the area of P , is an affinely invariant functional on n-gons whose maximizers coincide with the affinely regular polygons. We provide a complete proof of this result. We extend these area functionals to planar convex bodies and we present connecti...
متن کاملAn Inequality for Adjoint Rational Surfaces
We generalize an inequality for convex lattice polygons – aka toric surfaces – to general rational surfaces. Our collaboration started when the second author proved an inequality for algebraic surfaces which, when translated via the toric dictionary into discrete geometry, yields an old inequality by Scott [5] for lattice polygons. In a previous article [2], we were then able to refine this est...
متن کامل3D Origami Design based on Tucking Molecule
This paper presents a new approach for folding a piece of paper into an arbitrary three-dimensional polyhedral surface based on ”tucking molecules.” The approach is to align the polygons of the three-dimensional surface onto a convex region of a plane and fill the blank area between the polygons with ”tucking molecules.” Tucking molecules are aligned between segments and vertices of the polygon...
متن کاملA remark on the Erdös-Szekeres theorem
The Erdős–Szekeres theorem states that for any , any sufficiently large set of points in general position in the plane contains points in convex position. We show that for any and any finite sequence ! ! #" , with #$% & ( ')(+*, ! ! ), any sufficiently large set of points in general position in the plane contains either an empty convex ) gon or convex polygons . ! ! /. " , where 0 . $ 0,(& $ an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013